A Survey on Surface Reconstruction Algorithms for 3-D Unorganized points

نویسنده

  • Nidhi Sharma
چکیده

--Reconstruction of a 3-D object surface from sample of points has a wide range of applications such as computer-aided design (CAD) design, medical imaging,virtual reality and movie industry. The problem of approximating a surface from a given set of sample is known as surface reconstruction. This paper reviews the wellknown algorithms used to reconstruct the topology surface from sample points in three dimensional spaces. The sample points can be obtained from photogrammetry technique, laser scanner or any other mathematical function. Generally, the sample points will describe the shape and topology surface of the object. On application of the surface reconstruction algorithm on the sample points, the 3D model of the object can be obtained. A comparative study is done between the most eminent computational geometry based surface reconstruction algorithms. These algorithms are the Crust, the Power Crust, the Tight Cocone and the Ball Pivoting algorithm. The key issues for the comparison are the quality of the reconstructed surface, the execution time, and the speed. Keywords---Surface reconstruction,point clouds,CAD,reverse engineering,crust algorithm.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The displaced subdivision surface reconstruction from unorganized points

In this paper we propose a new mesh reconstruction scheme that produces a displaced subdivision surface directly from unorganized points. The displaced subdivision surface is a new mesh representation that defines a detailed mesh with a displacement map over a smooth domain surface, but original displaced subdivision surface algorithm needs an explicit polygonal mesh since it is not a mesh reco...

متن کامل

Orienting unorganized points for surface reconstruction

We address the problem of assigning consistently oriented normal vectors to unorganized point cloud with noises, non-uniformities, and thinsharp features as a pre-processing step to surface reconstruction. The conventional orienting scheme using minimal spanning tree fails on points with the above defects. Different from the recently developed consolidation technique, our approach does not modi...

متن کامل

A Delaunay-based region-growing approach to surface reconstruction from unorganized points

This paper presents a Delaunay-based region-growing (DBRG) surface reconstruction algorithm that holds the advantages of both Delaunay-based and region-growing approaches. The proposed DBRG algorithm takes a set of unorganized sample points from the boundary surface of a threedimensional object and produces an orientable manifold triangulated model with a correct geometry and topology that is f...

متن کامل

Direct Reconstruction of Displaced Subdivision Surface from Unorganized Points

In this paper we propose a new mesh reconstruction algorithm that produces a displaced subdivision mesh directly from unorganized points. The displaced subdivision surface is a new mesh representation that defines a detailed mesh with a displacement map over a smooth domain surface. This mesh representation has several benefits — compact mesh size, piecewise regular connectivity — to overcome l...

متن کامل

Reconstruction of Virtual Parts from Unorganized Scanned Data for Automated Dimensional Inspection

In the framework of Virtual CMM [1], virtual parts are proposed to be constructed as triangulated surface models. This paper presents a novel surface reconstruction method to the creation of virtual parts. It is based on the idea of identification and sculpting of concave regions of a Delaunay triangulation of the sample data. The proposed algorithm is capable of handling the reconstruction of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014